Efficient and Off-The-Shelf Solver: jArgSemSAT

نویسندگان

Federico Cerutti

Mauro Vallati

Massimiliano Giacomin

چکیده

jArgSemSAT is a Java re-implementation of ArgSemSAT—a SATbased solver for abstract argumentation problems—that can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Despite being written in Java, jArgSemSAT is very efficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

jArgSemSAT: An Efficient Off-the-Shelf Solver for Abstract Argumentation Frameworks

In this report from the field we describe jArgSemSAT, a Java re-implementation of ArgSemSAT. We show that jArgSemSAT can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. The performance section shows that—despite being written in Java—jArg...

متن کامل

Building flexible yet efficient abstraction/refinement solvers

This paper describes a method for combining “off-the-shelf” SAT and constraint solvers for building an efficient Satisfiability Modulo Theories (SMT) solver for a wide range of theories. Our method follows the abstraction/refinement approach to simplify the implementation of custom SMT solvers. The expected performance penalty by not using an interweaved combination of SAT and theory solvers is...

متن کامل

Efficient Inference and Structured Learning for Semantic Role Labeling

We present a dynamic programming algorithm for efficient constrained inference in semantic role labeling. The algorithm tractably captures a majority of the structural constraints examined by prior work in this area, which has resorted to either approximate methods or off-theshelf integer linear programming solvers. In addition, it allows training a globally-normalized log-linear model with res...

متن کامل

On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver

Off-the-shelf linear programming (LP) solvers trade soundness for speed: for efficiency, the arithmetic is not exact rational arithmetic but floating-point arithmetic. As a side-effect the results come without any formal guarantee and cannot be directly used for deciding linear arithmetic. In this work we explain how to design a sound procedure for linear arithmetic built upon an inexact floati...

متن کامل